Optimal Efficiency Guarantees for Network Design Mechanisms? Tim Roughgarden??1 and Mukund Sundararajan? ? ?1 Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, CA 94305.

Source URL: theory.stanford.edu

• Operations research
• Auction theory
• Mechanism design
• Game theory
• VickreyClarkeGroves mechanism
• Vickrey auction
• Optimization problem
• Mathematical optimization
• Steiner tree problem
• Shortest path problem
• Microeconomics

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Source URL: theory.stanford.edu

• NP-complete problems
• Knapsack problem
• Set cover problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• Greedy algorithm
• Dynamic programming
• Minimum spanning tree
• Algorithm
• Time complexity
• NP

Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Approximation algorithms
• Complexity classes
• Operations research
• NP-complete problems
• Polynomial-time approximation scheme
• Travelling salesman problem
• Steiner tree problem
• APX
• Optimization problem
• Combinatorial optimization
• NP

Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´

Source URL: www.math.washington.edu

• NP-complete problems
• Operations research
• Approximation algorithms
• Steiner tree problem
• Facility location problem
• APX
• Approximation

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni1 and Thomas Rothvoß2 1

Source URL: www.math.washington.edu

• Computational complexity theory
• Operations research
• Facility location problem
• Steiner tree problem
• Shortest path problem
• Approximation algorithm
• Low-rank approximation

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm

SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

I give an account of the paper [HJ06] on the prize-collecting generalized Steiner tree problem. 1 A Useful Lemma

Source URL: resources.mpi-inf.mpg.de

On Min-Power Steiner Tree⋆ Fabrizio Grandoni IDSIA, University of Lugano, Switzerland, Abstract In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a s

Source URL: people.idsia.ch